Taxonomy Completion via Triplet Matching Network

نویسندگان

چکیده

Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data business scope grow real applications, new concepts are emerging needed to be added the existing taxonomy. Previous approaches focus on expansion, i.e. finding an appropriate hypernym concept from for a query concept. In this paper, we formulate task, “taxonomy completion”, by discovering both hyponym query. We propose Triplet Matching Network (TMN), find pairs given TMN consists of one primal scorer multiple auxiliary scorers. These scorers capture various fine-grained signals (e.g., or semantics), makes holistic prediction triplet based internal feature representations all Also, innovative channel-wise gating mechanism that retains task-specific information introduced further boost model performance. Experiments four real-world large-scale datasets show achieves best performance completion task previous expansion outperforming methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wide Baseline Matching using Triplet Vector Descriptor

We propose an image matching method using triplet vector descriptor. The triplet vector descriptor consists of two different types of affine invariants: the gray level profile between two feature points and the two covariance matrices of those points. In order to establish point matches, we first vote the similarities of the triplet vector descriptors into candidate matches, and then, we verify...

متن کامل

Hybrid Metabolic Network Completion

Metabolic networks play a crucial role in biology since they capture all chemical reactions in an organism. While there are networks of high quality for many model organisms, networks for less studied organisms are often of poor quality and suffer from incompleteness. To this end, we introduced in previous work an ASP-based approach to metabolic network completion. Although this qualitative app...

متن کامل

Optimal Full Matching and Related Designs via Network Flows

In the matched analysis of an observational study, confounding on covariates X is addressed by comparing members of a distinguished group (Z = 1) to controls (Z = 0) only when they belong to the same matched set. The better matchings, therefore, are those whose matched sets exhibit both dispersion in Z and uniformity in X. For dispersion in Z, pair matching is best, creating matched sets that a...

متن کامل

Simulation of stochastic network dynamics via entropic matching.

The simulation of complex stochastic network dynamics arising, for instance, from models of coupled biomolecular processes remains computationally challenging. Often, the necessity to scan a model's dynamics over a large parameter space renders full-fledged stochastic simulations impractical, motivating approximation schemes. Here we propose an approximation scheme which improves upon the stand...

متن کامل

Climate Prediction via Matrix Completion

Recently, machine learning has been applied to the problem of predicting future climates, informed by the multi-model ensemble of physics-based climate models that inform the Intergovernmental Panel on Climate Change (IPCC). Past work (Monteleoni et al., 2011, McQuade and Monteleoni, 2012) demonstrated the promise of online learning algorithms applied to this problem. Here we propose a novel ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i5.16596